TSTP Solution File: NUM795^1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : NUM795^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 10:57:47 EDT 2023
% Result : Theorem 3.56s 3.80s
% Output : Proof 3.56s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM795^1 : TPTP v8.1.2. Released v3.7.0.
% 0.00/0.13 % Command : duper %s
% 0.14/0.34 % Computer : n001.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri Aug 25 14:09:13 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.56/3.80 SZS status Theorem for theBenchmark.p
% 3.56/3.80 SZS output start Proof for theBenchmark.p
% 3.56/3.80 Clause #0 (by assumption #[]): Eq (lessis x0 y0) True
% 3.56/3.80 Clause #1 (by assumption #[]): Eq (less z0 u0) True
% 3.56/3.80 Clause #2 (by assumption #[]): Eq (∀ (Xx0 Xy0 : rat), more Xx0 Xy0 → less Xy0 Xx0) True
% 3.56/3.80 Clause #3 (by assumption #[]): Eq (∀ (Xx0 Xy0 Xz0 Xu0 : rat), moreis Xx0 Xy0 → more Xz0 Xu0 → more (pl Xx0 Xz0) (pl Xy0 Xu0)) True
% 3.56/3.80 Clause #4 (by assumption #[]): Eq (∀ (Xx0 Xy0 : rat), lessis Xx0 Xy0 → moreis Xy0 Xx0) True
% 3.56/3.80 Clause #5 (by assumption #[]): Eq (∀ (Xx0 Xy0 : rat), less Xx0 Xy0 → more Xy0 Xx0) True
% 3.56/3.80 Clause #6 (by assumption #[]): Eq (Not (less (pl x0 z0) (pl y0 u0))) True
% 3.56/3.80 Clause #7 (by clausification #[2]): ∀ (a : rat), Eq (∀ (Xy0 : rat), more a Xy0 → less Xy0 a) True
% 3.56/3.80 Clause #8 (by clausification #[7]): ∀ (a a_1 : rat), Eq (more a a_1 → less a_1 a) True
% 3.56/3.80 Clause #9 (by clausification #[8]): ∀ (a a_1 : rat), Or (Eq (more a a_1) False) (Eq (less a_1 a) True)
% 3.56/3.80 Clause #10 (by clausification #[5]): ∀ (a : rat), Eq (∀ (Xy0 : rat), less a Xy0 → more Xy0 a) True
% 3.56/3.80 Clause #11 (by clausification #[10]): ∀ (a a_1 : rat), Eq (less a a_1 → more a_1 a) True
% 3.56/3.80 Clause #12 (by clausification #[11]): ∀ (a a_1 : rat), Or (Eq (less a a_1) False) (Eq (more a_1 a) True)
% 3.56/3.80 Clause #13 (by superposition #[12, 1]): Or (Eq (more u0 z0) True) (Eq False True)
% 3.56/3.80 Clause #14 (by clausification #[13]): Eq (more u0 z0) True
% 3.56/3.80 Clause #16 (by clausification #[3]): ∀ (a : rat), Eq (∀ (Xy0 Xz0 Xu0 : rat), moreis a Xy0 → more Xz0 Xu0 → more (pl a Xz0) (pl Xy0 Xu0)) True
% 3.56/3.80 Clause #17 (by clausification #[16]): ∀ (a a_1 : rat), Eq (∀ (Xz0 Xu0 : rat), moreis a a_1 → more Xz0 Xu0 → more (pl a Xz0) (pl a_1 Xu0)) True
% 3.56/3.80 Clause #18 (by clausification #[17]): ∀ (a a_1 a_2 : rat), Eq (∀ (Xu0 : rat), moreis a a_1 → more a_2 Xu0 → more (pl a a_2) (pl a_1 Xu0)) True
% 3.56/3.80 Clause #19 (by clausification #[18]): ∀ (a a_1 a_2 a_3 : rat), Eq (moreis a a_1 → more a_2 a_3 → more (pl a a_2) (pl a_1 a_3)) True
% 3.56/3.80 Clause #20 (by clausification #[19]): ∀ (a a_1 a_2 a_3 : rat), Or (Eq (moreis a a_1) False) (Eq (more a_2 a_3 → more (pl a a_2) (pl a_1 a_3)) True)
% 3.56/3.80 Clause #21 (by clausification #[20]): ∀ (a a_1 a_2 a_3 : rat),
% 3.56/3.80 Or (Eq (moreis a a_1) False) (Or (Eq (more a_2 a_3) False) (Eq (more (pl a a_2) (pl a_1 a_3)) True))
% 3.56/3.80 Clause #22 (by clausification #[4]): ∀ (a : rat), Eq (∀ (Xy0 : rat), lessis a Xy0 → moreis Xy0 a) True
% 3.56/3.80 Clause #23 (by clausification #[22]): ∀ (a a_1 : rat), Eq (lessis a a_1 → moreis a_1 a) True
% 3.56/3.80 Clause #24 (by clausification #[23]): ∀ (a a_1 : rat), Or (Eq (lessis a a_1) False) (Eq (moreis a_1 a) True)
% 3.56/3.80 Clause #25 (by superposition #[24, 0]): Or (Eq (moreis y0 x0) True) (Eq False True)
% 3.56/3.80 Clause #26 (by clausification #[25]): Eq (moreis y0 x0) True
% 3.56/3.80 Clause #27 (by superposition #[26, 21]): ∀ (a a_1 : rat), Or (Eq True False) (Or (Eq (more a a_1) False) (Eq (more (pl y0 a) (pl x0 a_1)) True))
% 3.56/3.80 Clause #28 (by clausification #[6]): Eq (less (pl x0 z0) (pl y0 u0)) False
% 3.56/3.80 Clause #29 (by clausification #[27]): ∀ (a a_1 : rat), Or (Eq (more a a_1) False) (Eq (more (pl y0 a) (pl x0 a_1)) True)
% 3.56/3.80 Clause #30 (by superposition #[29, 14]): Or (Eq (more (pl y0 u0) (pl x0 z0)) True) (Eq False True)
% 3.56/3.80 Clause #31 (by clausification #[30]): Eq (more (pl y0 u0) (pl x0 z0)) True
% 3.56/3.80 Clause #32 (by superposition #[31, 9]): Or (Eq True False) (Eq (less (pl x0 z0) (pl y0 u0)) True)
% 3.56/3.80 Clause #34 (by clausification #[32]): Eq (less (pl x0 z0) (pl y0 u0)) True
% 3.56/3.80 Clause #35 (by superposition #[34, 28]): Eq True False
% 3.56/3.80 Clause #37 (by clausification #[35]): False
% 3.56/3.80 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------